Compression of Propositional Resolution Proofs by Lowering Subproofs
Identifieur interne : 001617 ( Main/Exploration ); précédent : 001616; suivant : 001618Compression of Propositional Resolution Proofs by Lowering Subproofs
Auteurs : Joseph Boudou [France, Niger] ; Bruno Woltzenlogel Paleo [Autriche]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: This paper describes a generalization of the LowerUnits algorithm [8] for the compression of propositional resolution proofs. The generalized algorithm, called LowerUnivalents, is able to lower not only units but also subproofs of non-unit clauses, provided that they satisfy some additional conditions. This new algorithm is particularly suited to be combined with the RecyclePivotsWithIntersection algorithm [8]. A formal proof that LowerUnivalents always compresses more than LowerUnits is shown, and both algorithms are empirically compared on thousands of proofs produced by the SMT-Solver veriT.
Url:
DOI: 10.1007/978-3-642-40537-2_7
Affiliations:
- Autriche, France, Niger
- Midi-Pyrénées, Occitanie (région administrative)
- Toulouse
- Université Toulouse III - Paul Sabatier
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003A64
- to stream Istex, to step Curation: 003A20
- to stream Istex, to step Checkpoint: 000243
- to stream Main, to step Merge: 001629
- to stream Main, to step Curation: 001617
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Compression of Propositional Resolution Proofs by Lowering Subproofs</title><author><name sortKey="Boudou, Joseph" sort="Boudou, Joseph" uniqKey="Boudou J" first="Joseph" last="Boudou">Joseph Boudou</name></author><author><name sortKey="Woltzenlogel Paleo, Bruno" sort="Woltzenlogel Paleo, Bruno" uniqKey="Woltzenlogel Paleo B" first="Bruno" last="Woltzenlogel Paleo">Bruno Woltzenlogel Paleo</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:F539C12E96502AC3ABD893B6FDD5BE95DAC8AC1C</idno><date when="2013" year="2013">2013</date><idno type="doi">10.1007/978-3-642-40537-2_7</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-LM0R7VC0-K/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003A64</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003A64</idno><idno type="wicri:Area/Istex/Curation">003A20</idno><idno type="wicri:Area/Istex/Checkpoint">000243</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000243</idno><idno type="wicri:doubleKey">0302-9743:2013:Boudou J:compression:of:propositional</idno><idno type="wicri:Area/Main/Merge">001629</idno><idno type="wicri:Area/Main/Curation">001617</idno><idno type="wicri:Area/Main/Exploration">001617</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Compression of Propositional Resolution Proofs by Lowering Subproofs</title><author><name sortKey="Boudou, Joseph" sort="Boudou, Joseph" uniqKey="Boudou J" first="Joseph" last="Boudou">Joseph Boudou</name><affiliation wicri:level="4"><country xml:lang="fr">France</country><wicri:regionArea>Université Paul Sabatier, Toulouse</wicri:regionArea><placeName><region type="region">Occitanie (région administrative)</region><region type="old region">Midi-Pyrénées</region><settlement type="city">Toulouse</settlement></placeName><orgName type="university">Université Toulouse III - Paul Sabatier</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Niger</country></affiliation></author><author><name sortKey="Woltzenlogel Paleo, Bruno" sort="Woltzenlogel Paleo, Bruno" uniqKey="Woltzenlogel Paleo B" first="Bruno" last="Woltzenlogel Paleo">Bruno Woltzenlogel Paleo</name><affiliation wicri:level="1"><country xml:lang="fr">Autriche</country><wicri:regionArea>Vienna University of Technology</wicri:regionArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Autriche</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: This paper describes a generalization of the LowerUnits algorithm [8] for the compression of propositional resolution proofs. The generalized algorithm, called LowerUnivalents, is able to lower not only units but also subproofs of non-unit clauses, provided that they satisfy some additional conditions. This new algorithm is particularly suited to be combined with the RecyclePivotsWithIntersection algorithm [8]. A formal proof that LowerUnivalents always compresses more than LowerUnits is shown, and both algorithms are empirically compared on thousands of proofs produced by the SMT-Solver veriT.</div></front></TEI><affiliations><list><country><li>Autriche</li><li>France</li><li>Niger</li></country><region><li>Midi-Pyrénées</li><li>Occitanie (région administrative)</li></region><settlement><li>Toulouse</li></settlement><orgName><li>Université Toulouse III - Paul Sabatier</li></orgName></list><tree><country name="France"><region name="Occitanie (région administrative)"><name sortKey="Boudou, Joseph" sort="Boudou, Joseph" uniqKey="Boudou J" first="Joseph" last="Boudou">Joseph Boudou</name></region></country><country name="Niger"><noRegion><name sortKey="Boudou, Joseph" sort="Boudou, Joseph" uniqKey="Boudou J" first="Joseph" last="Boudou">Joseph Boudou</name></noRegion></country><country name="Autriche"><noRegion><name sortKey="Woltzenlogel Paleo, Bruno" sort="Woltzenlogel Paleo, Bruno" uniqKey="Woltzenlogel Paleo B" first="Bruno" last="Woltzenlogel Paleo">Bruno Woltzenlogel Paleo</name></noRegion><name sortKey="Woltzenlogel Paleo, Bruno" sort="Woltzenlogel Paleo, Bruno" uniqKey="Woltzenlogel Paleo B" first="Bruno" last="Woltzenlogel Paleo">Bruno Woltzenlogel Paleo</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001617 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001617 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:F539C12E96502AC3ABD893B6FDD5BE95DAC8AC1C
|texte= Compression of Propositional Resolution Proofs by Lowering Subproofs
}}
| This area was generated with Dilib version V0.6.33. |  |